A Fast Recursive Algorithm for Computing Cr-type Bounds for Image Reconstruction Problems

نویسندگان

  • A. O.
  • J.
  • W. L.
چکیده

In this paper we describe a method for computing matrix CR bounds for image reconstruction problems using an iterative algorithm that avoids the intractable inversion of the Fisher matrix required by direct methods. The algorithm produces a close approximation to the CR bound requiring only o(n2) floating point operations per pixel of interest; an order of magnitude saving relative to the O(n3) flops required by non-iterative methods. To illustrate the utility of our iterative algorithm we study a prototypical application: the dependence of achievable reconstruction accuracy on angular and radial sampling.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Recursive Algorithm for Computing Cr-type Bounds for Image Reconstruction Problems

In this paper we describe a method for computing matrix CR bounds for image reconstruction problems using an iterative algorithm that avoids the intractable inversion of the Fisher matrix required by direct methods. The algorithm produces a close approximation to the CR bound requiring only O(n 2) oating point operations per pixel of interest ; an order of magnitude savings relative to the O(n ...

متن کامل

Fast System Matrix Calculation in CT Iterative Reconstruction

Introduction: Iterative reconstruction techniques provide better image quality and have the potential for reconstructions with lower imaging dose than classical methods in computed tomography (CT). However, the computational speed is major concern for these iterative techniques. The system matrix calculation during the forward- and back projection is one of the most time- cons...

متن کامل

Ultra-Fast Image Reconstruction of Tomosynthesis Mammography Using GPU

Digital Breast Tomosynthesis (DBT) is a technology that creates three dimensional (3D) images of breast tissue. Tomosynthesis mammography detects lesions that are not detectable with other imaging systems. If image reconstruction time is in the order of seconds, we can use Tomosynthesis systems to perform Tomosynthesis-guided Interventional procedures. This research has been designed to study u...

متن کامل

Pothole Detection by Soft Computing

Subject- Potholes on roads are regarded as serious problems in the transportation domain and ignoring them leads to the increase of accidents, traffic, vehicle fuel consumption and waste of time and energy. As a result, pothole detection has attracted researchers’ attention and different methods have been presented for it up to now. Background- The major part of previous research is based on i...

متن کامل

Bounds on achievable convergence rates of parameter estimators via universal coding

In many SPECT and PET tomographic geometries, the m X n (m 2 n) system response (($,,)) is a sparse matrix, i.e., its number of nonzero elements is only O(n) as compared to O(n2) for the nonsparse case. Note, however, that even when the system response matrix is sparse, the matrix A (25) is not generally sparse, and it would appear that the recursive algorithm (IO) of Carollary 1 requires O(n2)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004